An upper bound for total colouring of graphs
نویسندگان
چکیده
منابع مشابه
An upper bound for total colouring of graphs
McDiarmid C.J.H. and A. Sanchez-Arroyo, An upper bound for total colouring of graphs, Discrete Mathematics 111 (1993) 3899392. We give an upper bound on the number of colours required to extend a given vertex colouring of a graph to a total colouring. This shows that for any simple graph there is a total colouring using at most :d + 3 colours, where A is the maximum vertex degree.
متن کاملEdge-colouring and total-colouring chordless graphs
A graph G is chordless if no cycle in G has a chord. In the present work we investigate the chromatic index and total chromatic number of chordless graphs. We describe a known decomposition result for chordless graphs and use it to establish that every chordless graph of maximum degree ∆ ≥ 3 has chromatic index ∆ and total chromatic number ∆+1. The proofs are algorithmic in the sense that we ac...
متن کاملAn Upper Bound for the Total Restrained Domination Number of Graphs
Let G be a graph with vertex set V . A set D ⊆ V is a total restrained dominating set of G if every vertex in V has a neighbor in D and every vertex in V \D has a neighbor in V \D. The minimum cardinality of a total restrained dominating set of G is called the total restrained domination number of G, and is denoted by γtr(G). In this paper, we prove that if G is a connected graph of order n ≥ 4...
متن کاملA tight bound for online colouring of disk graphs
We present an improved upper bound on the competitiveness of the online colouring algorithm First-Fit in disk graphs, which are graphs representing overlaps of disks on the plane. We also show that this bound is best possible for deterministic online colouring algorithms that do not use the disk representation of the input graph. We also present a related new lower bound for unit disk graphs. c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1993
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90175-s